On Computing Symmetries and Stubborn Sets on Computing Symmetries and Stubborn Sets
نویسنده
چکیده
In this report, we consider two promising methods for alleviating the state space explosion problem in reachability analysis: the symmetry method and the stubborn set method. We concentrate on the computation of symmetries and stubborn sets. The new algorithms presented in this report help us to save time and space in the symmetry method and to avoid inspecting redundant states in the so called CFFD-preserving stubborn set method.
منابع مشابه
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core
In the last years, pruning techniques based on partial order reduction have found increasing attention in the planning community. One recent result is that the expansion core method is a special case of the strong stubborn sets method proposed in model checking. However, it is still an open question if there exist efficiently computable strong stubborn sets with strictly higher pruning power th...
متن کاملFinding Small Stubborn Sets Automatically
State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.
متن کاملEfficient Detection of Deadlocks in Petri Nets
Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This report considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state sp...
متن کاملA State Space Tool for Models Expressed In C++ (tool paper)
This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its name is ASSET. Model checking takes place by compiling the model and the tool together, and executing the result. This approach facilitates very fast execution of the transitions of the model. On the other hand, the use ...
متن کاملDecoupled Strong Stubborn Sets
Recent work has introduced fork-decoupled search, addressing classical planning problems where a single center component provides preconditions for several leaf components. Given a fixed center path ⇡ C , the leaf moves compliant with ⇡C can then be scheduled independently for each leaf. Forkdecoupled search thus searches over center paths only, maintaining the compliant paths for each leaf sep...
متن کامل